Introduction to the Fast Marching Method
نویسنده
چکیده
In these notes, we present an introduction to the classical Fast Marching Method (FMM). The FMM has been first introduced to find numerical approximations of the solutions to the stationary eikonal equation. More generally we show that this method allows to find exactly the solutions of numerical schemes that satisfy a certain causality assumption. In order to motivate this method, we present the shape from shading problem, introduce the notion of viscosity solutions to the stationary eikonal equation and consider finite differences schemes. We also provide various comparison principles for the eikonal equation and for the schemes. We give an error estimate between the numerical solution and the viscosity solution. We finally indicate some extensions of the FMM to more general equations than the stationary eikonal equation.
منابع مشابه
Fast Methods for Eikonal Equations: an Experimental Survey
The Fast Marching Method is a very popular algorithm to compute times-of-arrival maps (distances map measured in time units). Since their proposal in 1995, it has been applied to many different applications such as robotics, medical computer vision, fluid simulation, etc. Many alternatives have been proposed with two main objectives: to reduce its computational time and to improve its accuracy....
متن کاملModified Fast Level Set Method and Fast Marching Method for Medical Images
In this paper, an interactive segmentation method that combines fast marching and fast level set method is proposed. Level set segmentation involves solving the energybased active contour minimization problems by the computation of geodesics or minimal distance curves. First, by selecting the seed point, the fast marching method is used to extract rough boundaries of the interested object. We m...
متن کاملNumerical Methods for Advancing Interfaces
A propagating interface can develop corners and discontinuities as it advances. The level set algorithm such as the fast marching method (FMM) has been extensively applied in simulating advancing fronts. However, it is a rstorder scheme and hard to incorporate higher-order schemes in realistic media; it costs O(N log2N), where N is the number of grid points. The article is concerned with the de...
متن کاملShort Note A second-order fast marching eikonal solver
Unfortunately, first-order implementations lead to inaccuracies in computed traveltimes, which may lead to poor image focusing for migration applications. In addition, first-order traveltimes are not accurate enough for reliable amplitude calculations. This has lead to the development of the fast marching method on non-Cartesian (Alkhalifah and Fomel, 1997; Sun and Fomel, 1998), and even unstru...
متن کاملA second - order fast marching eikonal solver
Unfortunately, first-order implementations lead to inaccuracies in computed traveltimes, which may lead to poor image focusing for migration applications. In addition, first-order traveltimes are not accurate enough for reliable amplitude calculations. This has lead to the development of the fast marching method on non-Cartesian (Alkhalifah and Fomel, 1997; Sun and Fomel, 1998), and even unstru...
متن کامل